منابع مشابه
K-processor Scheduling
It is shown that the Precedence Constrained K-Processor Scheduling problem is W2]-hard. This means that there does not exist a constant c, such that for all xed K, the Precedence Constrained K-Processor Scheduling problem can be solved in O(n c) time, unless an unlikely collapse occurs in the parameter-ized complexity hierarchy introduced by Downey and Fellows (see 5]). That is, if the problem ...
متن کاملClosed-Form Deterministic End-to-End Performance Bounds for the Generalized Processor Sharing Scheduling Discipline
The Generalized Processor Sharing (GPS) scheduling discipline is an important scheduling mechanism that can support both class isolation and bandwidth sharing among different service classes, thus making it an appealing choice for networks providing multiple services with Quality-of-Service guarantees. In this paper, we study a broad class of GPS networks known as Consistent Relative Session Tr...
متن کاملShared processor scheduling
We study the shared processor scheduling problem with a single shared processor where a unit time saving (weight) obtained by processing a job on the shared processor depends on the job. A polynomialtime optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an O(n log n) optimization algorithm for a class of instanc...
متن کاملEclipse Processor Scheduling
Eclipse is an architectural framework for on-chip CPU and coprocessor communication, combining application configuration flexibility with the efficiency of functionspecific hardware. A Kahn process network application model is supported by a generic communication infrastructure and function-specific processors with multi-tasking capabilities. High data bandwidth and limited stream buffer memory...
متن کاملShared multi-processor scheduling
We study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job’s completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load schedulin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Computing Surveys
سال: 1977
ISSN: 0360-0300,1557-7341
DOI: 10.1145/356698.356700